In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine. == Operation == Linear bounded automata satisfy the following three conditions: As in the definition of Turing machines, it possesses a tape made up of cells that can contain symbols from a finite alphabet, a he...